The Collaborative Carrier Vehicle Routing Problem for Capacitated Traveling Salesman Tours
نویسندگان
چکیده
This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a pickup and delivery scenario in [BB07] we now use it for the vehicle routing of a carrier network offering LTL pickup services leading to a set of interdependent capacitated traveling salesman tours.
منابع مشابه
Routing vehicles to minimize fuel consumption
We consider a generalization of the capacitated vehicle routing problem known as the cumulative vehicle routing problem in the literature. Cumulative VRPs are known be a simple model for fuel consumption in VRPs. We examine four variants of the problem, and give constant factor approximation algorithms. Our results are based on a well-known heuristic of partitioning the traveling salesman tours...
متن کاملA Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
The Capacitated Vehicle Routing problem is a generalization of the Traveling Salesman problem in which a set of clients must be visited by a collection of capacitated tours. Each tour can visit at most Q clients and must start and end at a specified depot. We present the first approximation scheme for Capacitated Vehicle Routing for non-Euclidean metrics. Specifically we give a quasi-polynomial...
متن کاملOn Capacitated Vehicle Routing
We consider the capacitated vehicle routing problem (VRP): a fixed fleet of delivery vehicles of uniform capacity must service at minimal transit cost from a common depot known customer demand for a single commodity. This problem is modeled as a side-constrained traveling salesman problem (TSP). Among the additional constraints are the vehicle capacity restrictions, analogous to TSP subtour eli...
متن کاملCRT-95-74 AN ADAPTIVE MEMORY HEURISTIC FOR A CLASS OF VEHICLE ROUTING PROBLEMS WITH MINMAX OBJECTIVE by
We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.
متن کاملCapacitated Vehicle Routing and the k-Delivery n-Traveling Salesman Problem
Vehicle routing problems attempt to define optimal delivery methods of goods to places. I examined the capacitated vehicle routing problem that determines the least cost route to deliver objects to customers using a single vehicle of fixed capacity. Vehicle routing problems attract considerable attention because of their implications for delivery businesses. My variant of the problem differs fr...
متن کامل